Standard Cell Placement using Iterative & Constructive Heuristics for Multi-Objective Optimization

نویسندگان

  • Aaquil Bunglowala
  • Brijmohan Singhi
  • Ajay Verma
چکیده

Focus in the present rests on optimization of multi-objective standard cell placement for maximizing the speed and minimizing power and interconnect wire-length with cell-width as a constraint. It incorporates fuzzy cost function rules for designing of multi-objectives to integrate the cost of above defined objectives. A significant improvement is reported when the iterative-constructive standard cell-placer combines a course grain timing-driven partitioning followed by adaptive time driven construction of rows as well as selection of driver size. Iterative heuristic algorithms have been developed on Genetic algorithm. These techniques are applied to standard cell ami libraries 20, 33 and 120. 20% improvement in results on average running; almost twice faster than the commercial tools; and reduction of power by 12% is reported for the same timing and wire-length.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Parallel Evolutionary Algorithms for Multiobjective Placement Problem

Non-deterministic iterative heuristics such as Tabu Search (TS), Simulated Evolution (SimE), Simulated Annealing (SA), and Genetic Algorithms (GA) are being widely adopted to solve a range of hard optimization problems [1]. This interest is attributed to their generality, ease of implementation, and their ability to deliver high quality results. However, depending on the size of the problem, su...

متن کامل

Optimization of Agricultural BMPs Using a Parallel Computing Based Multi-Objective Optimization Algorithm

Beneficial Management Practices (BMPs) are important measures for reducing agricultural non-point source (NPS) pollution. However, selection of BMPs for placement in a watershed requires optimizing available resources to maximize possible water quality benefits. Due to its iterative nature, the optimization typically takes a long time to achieve the BMP trade-off results which is not desirable ...

متن کامل

Chapter 7 Review of Iterative Algorithms for Placement

Placement problem has been proven to be NP hard. It is impractical to perform an exhaustive search to find the optimal solution for a large circuit. Thus, algorithms based on heuristic rationales are commonly employed. An ideal approach is to get an initial solution using a constructive algorithm and then uses an iterative algorithm to improve it. So, it is desirable to develop better improveme...

متن کامل

Simulated evolution for timing and low power VLSI standard cell placement

This paper presents a Fuzzy Simulated Evolution algorithm for VLSI standard cell placement with the objective of minimizing power, delay and area. For this hard multiobjective combinatorial optimization problem, no known exact and efficient algorithms exist that guarantee finding a solution of specific or desirable quality. Approximation iterative heuristics such as Simulated Evolution are best...

متن کامل

Multi-objective Based Optimization Using Tap Setting Transformer, DG and Capacitor Placement in Distribution Networks

In this article, a multi-objective function for placement of Distributed Generation (DG) and capacitors with thetap setting of Under Load Tap Changer (ULTC) Transformer is introduced. Most of the recent articles have paidless attention to DG, capacitor placement and ULTC effects in the distribution network simultaneously. Insimulations, a comparison between different modes was carried out with,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010